apex graph造句
例句与造句
- However, there exist linklessly embeddable graphs that are not apex graphs.
- Robertson's apex graph is shown in the figure.
- However, Neil Robertson provided an example of an apex graph that is not Y?Y-reducible.
- The null graph is also counted as an apex graph even though it has no vertex to remove.
- Because the rhombic dodecahedron's graph is planar, Robertson's graph is an apex graph.
- It's difficult to find apex graph in a sentence. 用apex graph造句挺难的
- Flat embeddings are automatically linkless, but not vice versa . and include the planar graphs and apex graphs.
- The apex graphs include graphs that are themselves planar, in which case again every vertex is an apex.
- Like the apex graphs and the linkless embeddable graphs, the Y?Y-reducible graphs are closed under graph minors.
- Similarly, every contraction-bidimensional problem \ Pi with the separation property and with finite integer index has a linear vertex kernel on graphs excluding some fixed apex graph as a minor.
- In graph theory, a branch of mathematics, an "'apex graph "'is a graph that can be made planar by the removal of a single vertex.
- The graphs with Hadwiger number at most five include the apex graphs and the linklessly embeddable graphs, both of which have the complete graph " K " 6 among their forbidden minors.
- Linklessly embeddable graphs form a minor-closed family with the seven graphs in the Petersen family as their minimal forbidden minors; therefore, these graphs are also forbidden as minors for the apex graphs.
- Since every apex graph is linkless embeddable, this shows that there are graphs that are linkless embeddable but not Y?Y-reducible and therefore that there are additional forbidden minors for the Y?Y-reducible graphs.
- However, if arbitrary crossings are allowed, it becomes NP-hard to minimize the number of crossings, even in the special case of apex graphs formed by adding a single edge to a planar graph.
- Despite the complete set of forbidden minors remaining unknown, it is possible to test whether a given graph is an apex graph, and if so, to find an apex for the graph, in linear time.
更多例句： 下一页